A Bit-Window based Algorithm for Balanced and Efficient Object Placement and Lookup in Large-scale Object Based Storage Cluster

Business requirements for data availability, survivability, and performance have driven the need for building the network storage that interconnects various kinds of storage devices to allow remote access by multiple hosts. A new revolutionary storage technology called “Object based Storage Devices (OSD)” is now emerging as a promising technology to meet the high performance needs and to address various local storage issues. At the same time, it poses several challenges including efficient object placement and lookup in the dynamically changing storage resource environment. We develop a novel and efficient method based on BitWindows for object placement and lookup services. We demonstrate the effectiveness of our method through theoretical analysis and simulations results.